Bounds for the sample size in performance testing of combinatorial algorithms
نویسندگان
چکیده
The performance of combinatorial algorithms is often evaluated by using the computational times of a certain number of inputs. The run times of algorithms with certain type of data appear in computational results as the mean of a small sample. Still the choice of sample size is rarely based on the distribution of run times. In this work we use statistical tests to compare the performance of combinatorial algorithms. Furthermore, we determine confidence intervals for the run times of combinatorial algorithms. As a consequence, we get easy-touse bounds of sample size for justifying the accuracy of computational results.
منابع مشابه
Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملDetermination of the size distribution of monodesperse and bidisperse mixtures of spherical particles in the nanometer and submicron size range by applying cumulant analysis and contin algorithm in dynamic light scattering
Determination of particle size is one of the major needs in the industry and biotechnology. Dynamic light scattering (DLS) is a widely used technique for determining size distribution of spherical particle in nanometer and submicron size range. In this method, there are different algorithms for determining the size and size distribution of particles, which are selected according to the required...
متن کاملElectromagnetism-like Algorithms for The Fuzzy Fixed Charge Transportation Problem
In this paper, we consider the fuzzy fixed-charge transportation problem (FFCTP). Both of fixed and transportation cost are fuzzy numbers. Contrary to previous works, Electromagnetism-like Algorithms (EM) is firstly proposed in this research area to solve the problem. Three types of EM; original EM, revised EM, and hybrid EM are firstly employed for the given problem. The latter is being firstl...
متن کاملUsing the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength
Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...
متن کاملReliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures (RESEARCH NOTE)
Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...
متن کامل